Bubblesort and Juggling Sequences
نویسنده
چکیده
منابع مشابه
Primitive Juggling Sequences
Over the past two decades, a number of ways have been developed for representing periodic juggling patterns by nite sequences of nonnegative integers. In the most common of these, the entries of the sequence indicate how long the thrown object stays in the air. These juggling sequences have many interesting mathematical properties. In particular, each juggling sequence has associated with it a ...
متن کاملEnumerating (multiplex) juggling sequences
We consider the problem of enumerating periodic σ-juggling sequences of length n for multiplex juggling, where σ is the initial state (or landing schedule) of the balls. We first show that this problem is equivalent to choosing 1’s in a specified matrix to guarantee certain column and row sums, and then using this matrix, derive a recursion. This work is a generalization of earlier work of Fan ...
متن کاملJuggling card sequences
Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck paths, Narayana numbers, boson normal ordering, arc-labeled digraphs, and more. Some of these connections are investigated with a particular focus on enumerating...
متن کاملar X iv : m at h / 06 02 47 6 v 1 [ m at h . G T ] 2 1 Fe b 20 06 JUGGLING BRAIDS AND LINKS
Using a simplistic model of juggling based on physics, a natural map is constructed from the set of periodic juggling patterns (or site swaps) to links. We then show that all topological links can be juggled. 1. Juggling sequences The art of juggling has been around for thousands of years. Over the past quarter of a century, the interplay between juggling and mathematics has been well studied. ...
متن کاملA Simple D Bubblesort for the Mesh with Good Average Case Complexity
We study the complexity of a natural generalization of the parallel odd even transposition sort or bubblesort to dimensions and prove that O p N lgN steps su ce to sort a random N element permu tation on an p N p N processor mesh with very high probability This answer a question posed by Leighton in Simulation results suggest that the constants involved are in fact quite small and that the aver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009